Exploiting non-Markovian Bio-Processes
نویسندگان
چکیده
The Stochastic Simulation Algorithm (SSA) is a milestone in the realm of stochastic modeling of biological systems, as it inspires all the current algorithms for stochastic simulation. Essentially, the SSA shows that under certain hypothesis the time to the next occurrence of a biochemical reaction is a random variable following a negative exponential distribution. Unfortunately, the hypothesis underlying SSA are difficult to meet, and modelers have to face the impact of assuming exponentially distributed reactions besides the prescribed scope of applicability. An opportunity of investigation is offered by the use of generally distributed reaction times. In this paper, we describe how general distributions are introduced into BlenX, a programming language designed for specifying biological models. We then experiment the new extension on few examples of increasing complexity and discuss how the quantitative behaviour of a model is affected by the choice of the reaction time distribution.
منابع مشابه
A Partially Observable Markovian Maintenance Process with Continuous Cost Functions
In this paper a two-state Markovian maintenance process where the true state is unknown will be considered. The operating cost per period is a continuous random variable which depends on the state of the process. If investigation cost is incurred at the beginning of any period, the system wit I be returned to the "in-control" state instantaneously. This problem is solved using the average crite...
متن کاملQuantum filter processes driven by Markovian white noises have classical versions
We study quantum filters that are driven by basic quantum noises and construct classical versions. Our approach is based on exploiting the quantum markovian component of the observation and measurement processes of the filters. This approach leads in a natural way the classical versions for a class of quantum filters. We consider quantum white noises derived from Wiener and Poisson processes th...
متن کاملBio-PEPAd: A non-Markovian extension of Bio-PEPA
Delays in biological systems may be used to model events for which the underlying dynamics cannot be precisely observed, or to provide abstraction of some behavior of the system resulting in more compact models. In this paper we enrich the stochastic process algebra Bio-PEPA, with the possibility of assigning delays to actions, yielding a new non-Markovian stochastic process algebra: Bio-PEPAd....
متن کاملNon-Markovian Rewards Expressed in LTL: Guiding Search Via Reward Shaping
We propose an approach to solving Markov Decision Processes with non-Markovian rewards specified in Linear Temporal Logic interpreted over finite traces (LTLf ). Our approach integrates automata representations of LTLf formulae into compiled MDPs that can be solved by off-the-shelf MDP planners, exploiting reward shaping to help guide search. Experiments with state-of-the-art UCT-based MDP plan...
متن کاملA new reduction method for the analysis of large workflow models
This paper presents a new net-reduction methodology to facilitate the analysis of large workflow models. We propose an enhanced algorithm based on reducible subnet identification which preserves both soundness and completion time distribution. Moreover we outline an approach to model the dynamic behavior of business processes by exploiting the power of a class of non-Markovian stochastic Petri ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 253 شماره
صفحات -
تاریخ انتشار 2009